A simple and robust batch-ordering inventory policy under incomplete demand knowledge

نویسندگان

  • Liwei Bai
  • Christos Alexopoulos
  • Mark E. Ferguson
  • Kwok-Leung Tsui
چکیده

Generally, the derivation of an inventory policy requires the knowledge of the underlying demand distribution. Unfortunately, in many settings such as retail, demand is not completely observable in a direct way or inventory records may be inaccurate. A variety of factors, including the potential inaccuracy of inventory records, motivate retailers to seek replenishment policies with a fixed order quantity. We derive estimators of the first two moments of the (periodic) demand by means of renewal theoretical concepts. We then propose a regressionbased approximation to improve the quality of the estimators. These estimators are used in conjunction with the Power Approximation (PA) method of Ehrhardt and Mosier (1984) to obtain an (r,Q) replenishment policy. The proposed methodology is robust and easy to code into a spreadsheet application. A series of numerical studies are carried out to evaluate the accuracy and precision of the estimators, and to investigate the impact of the estimation on the optimality of the inventory policies. Our experiments indicate that the proposed (r,Q) policy is very close, with regard to the mean total cost per period, to the (s, S) policy obtained via the PA method when the demand process is fully observable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new robust cycle-based inventory control policy

Abstract In this paper, we propose a new robust cycle-based control policy for single installation inventory models with non-stationary uncertain demand. The policy is simple, flexible, easily implementable and preliminary numerical experiments suggest that the policy has very promising empirical performance. The policy can be used both when the excess demand is backlogged as well as when it is...

متن کامل

One-for-One Period Policy and its Optimal Solution

In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...

متن کامل

Optimal Ordering Policy with Stock-Dependent Demand Rate under Permissible Delay in Payments

We develop an inventory model to determine optimal ordering policy under permissible delay in payment by considering demand rate to be stock dependent. Mathematical models are derived under two different cases: credit period being greater than or equal to cycle time for settling the account, and credit period being less than or equal to cycle time for settling the account. The results are illus...

متن کامل

Combined Sales Effort and Inventory Control under Demand Uncertainty

We study the joint inventory and sales effort management problems of a retailer in a broad context and investigate the optimal policies for a single item, periodic-review system. In each period, the demand is uncertain depending on the sales effort level exerted by the retailer, which incurs an associated cost. The retailer’s objective is to find a joint optimal inventory replenishment and sale...

متن کامل

Queueing Inventory System in a Two-level Supply Chain with One-for-One Ordering Policy

Consider a two-level inventory system consisting of one supplier and one retailer. The retailer faces a Poisson demand with a known rate and applies base stock (one-for-one ordering) policy. That is, his inventory position is set to a pre-determined level, so the demand pattern is transferred exactly to the supplier. The supplier has an inventory system and a service unit with exponentially dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Industrial Engineering

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2012